DELFT UNIVERSITY OF TECHNOLOGY REPORT 08-09 SIMPLE-type preconditioners for the Oseen problem

نویسندگان

  • M. ur Rehman
  • C. Vuik
  • G. Segal
چکیده

In this report, we discuss block preconditioners used to solve the incompressible Navier-Stokes equations. We emphasize on the approximation of the Schur complement used in SIMPLE-type preconditioners. In the usual formulation, the Schur complement uses scaling with the diagonal of the convection diffusion matrix. A variant of SIMPLE, SIMPLER is studied. Convergence of the SIMPLER preconditioner depends on the grid size, but not on the Reynolds number. We introduce a new variant of SIMPLER (Modified SIMPLER or MSIMPLER), based on the diagonal of the velocity mass matrix as scaling matrix instead of the diagonal of the convection-diffusion matrix. With the new approximation, we observe a drastic improvement in convergence for fairly large problems. MSIMPLER shows better convergence than the well-known least-squares commutator (LSC) preconditioner which is also based on the diagonal of the velocity mass matrix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DELFT UNIVERSITY OF TECHNOLOGY REPORT 08-05 Theoretical Comparison of Two-Level Preconditioners based on Multigrid and Deflation

It is well-known that two-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coefficient matrices are symmetric and positive definite (SPD). A two-level PCG method combines traditional and projectiontype preconditioners to get rid of the effect of both small and large eigenvalues of the coefficient matrix. In the ...

متن کامل

Pressure Schur Complement Preconditioners for the Discrete Oseen Problem

We consider several preconditioners for the pressure Schur complement of the discrete steady Oseen problem. Two of the preconditioners are well known from the literature and the other is new. Supplemented with an appropriate approximate solve for an auxiliary velocity subproblem these approaches give rise to a family of the block preconditioners for the matrix of the discrete Oseen system. In t...

متن کامل

DELFT UNIVERSITY OF TECHNOLOGY REPORT 06-09 Efficient d-Multigrid Preconditioners for Sparse-Grid Solution of High-Dimensional Partial Differential Equations

No part of the Journal may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior writ-Fast and efficient solution techniques are developed for high-dimensional parabolic partial differential equations (PDE). In this paper we present a robust solver based on the Krylov subspace me...

متن کامل

DELFT UNIVERSITY OF TECHNOLOGY REPORT 13-11 Evaluation of Multilevel Sequentially Semiseparable Preconditioners on CFD Benchmark Problems Using IFISS

This paper studies a new preconditioning technique for sparse systems arising from discretized partial differential equations (PDEs) in computational fluid dynamics (CFD), which exploit the multilevel sequentially semiseparable (MSSS) structure of the system matrix. MSSS matrix computations give a data-sparse way to approximate the LU factorization of a sparse matrix from discretized PDEs in li...

متن کامل

DELFT UNIVERSITY OF TECHNOLOGY REPORT 08-08 Solving Large Sparse Linear Systems Efficiently on Grid Computers using an Asynchronous Iterative Method as a Preconditioner

In this paper we describe an efficient iterative algorithm for solving large sparse linear systems on Grid computers and review some of its advantages and disadvantages. The algorithm is a combination of a synchronous flexible outer iterative method and a coarse–grain asynchronous inner iterative method as a preconditioner. We present results of a complete implementation using mature Grid middl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008